Visual Theorem Proving with the Incredible Proof Machine
نویسنده
چکیده
The Incredible Proof Machine is an easy and fun to use program to conduct formal proofs. It employs a novel, intuitive proof representation based on port graphs, which is akin to, but even more natural than, natural deduction. In particular, we describe a way to determine the scope of local assumptions and variables implicitly. Our practical classroom experience backs these claims.
منابع مشابه
Proving a Theorem in Zero-Knowledge
In 1986, Manuel Blum claimed in his paper ”How to Prove a Theorem So No One Else Can Claim It” that he could apply zero-knowledge methods to proving theorems in any proof system. He sketched a proof of this result, but gave no details. We give a background of zero-knowledge proofs and examine their applicability to the propositional calculus. We then examine Blum’s claim, assuming the existence...
متن کاملLearning Intelligent Theorem Proving from Large Formal Corpora
The talk will discuss several AI methods used to learn proving of conjectures over large formal mathematical corpora. This includes (i) machine-learning methods that learn from previous proofs how to suggest the most relevant lemmas for proving the next conjectures, (ii) methods that guide low-level proof-search algorithms based on previous proof traces, and (iii) methods that automatically inv...
متن کاملA Mechanisation of Computability Theory in HOL
This paper describes a mechanisation of computability theory in HOL using the Unlimited Register Machine (URM) model of computation. The URM model is rst speciied as a rudimentary machine language and then the notion of a computable function is derived. This is followed by an illustration of the proof of a number of basic results of computability which include various closure properties of comp...
متن کاملSome Experiments on the Applicability of FoldingArchitecture Networks to Guide Theorem
One of the major problems in theorem proving is the control of proof search. A promising approach is the application of machine learning techniques for the acquisition of search control knowledge by learning from successful proof searches. In this paper we shortly discuss this idea and existing machine learning techniques for this task. We then suggest folding architecture networks trained with...
متن کاملSaturation-Based Theorem Proving: Past Successes and Future Potential (Abstract)
A resolution theorem prover for intuitionistic logic p. 2 Proof-terms for classical and intuitionistic resolution p. 17 Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-Unification p. 32 Extensions to a generalization critic for inductive proof p. 47 Learning domain knowledge to improve theorem proving p. 62 Patching faulty conjectures p. 77 Internal analogy i...
متن کامل